Search results for "Work planning"
showing 10 items of 23 documents
District heating networks: enhancement of the efficiency
2019
International audience; During the decades the district heating's (DH) advantages (more cost-efficient heat generation and reduced air pollution) overcompensated the additional costs of transmission and distribution of the centrally produced thermal energy to consumers. Rapid increase in the efficiency of low-power heaters, development of separated low heat density areas in cities reduce the competitiveness of the large centralized DH systems in comparison with the distributed cluster-size networks and even local heating. Reduction of transmission costs, enhancement of the network efficiency by optimization of the design of the DH networks become a critical issue. The methodology for determ…
Contributions to Branch-and-Price-and-Cut Algorithms for Routing Problems
2019
This article deals with new exact branch-and-price-and-cut algorithms for the solution of routing problems. Specialized methods for the pickup-and-delivery problem (PDP), the truck-and-trailer routing problem (TTRP), the periodic vehicle routing problem (PVRP) and a service network design and hub location problem (SNDHLP) are presented. We develop a new technique for the acceleration of bidirectional labeling algorithms by a dynamic choice of the merge point. Moreover, for variants of the PDP, the bidirectional labeling can be effectively applied for the first time. In the TTRP, we model the extension to a 2 days planning horizon and the consideration of a quantity-dependent transfer time. …
Branch-and-price-and-cut for a service network design and hub location problem
2015
In the context of combined road-rail freight transport, we study the integrated tactical planning of hub locations and the design of a frequency service network. We consider a number of real-world constraints such as multiple transshipments of requests at hubs, transport time limits for requests, request splitting, and outsourcing possibilities. To our knowledge, the combination of problem features we deal with has not been described before. We present a path-based model and solve it with a branch-and-price-and-cut algorithm. Computational experiments show that large realistic instances from a major German rail freight company can be solved close to optimality within one hour on a standard …
A GIS-MCDM-based road network planning for tourism development and management in Arasbaran forest, Iran.
2019
It is very important for managers to plan a road network that meets all the requirements for tourism development and management. The aim of this study was to evaluate and modify an existing road network for tourism purposes in the Arasbaran protected area. First, the map layers of effective criteria were prepared in GIS and were standardized by a fuzzy logic approach and finally combined considering their relative importance weights obtained through pair-wise comparison technique. A suitability map was then acquired. After that, 14 different scenarios of road network were designed to access the recreational area using PEGGER extension in ArcView. Then, they were evaluated in terms of techni…
Maximizing network capacity in an heterogeneous macro-micro cellular scenario
2011
The problem of resource allocation in cellular networks has been traditionally faced at two different levels: at the network level, in terms of frequency planning and reuse pattern design, and at the cell level, in terms of cell capacity optimizations based on channel-dependent scheduling, link adaptation, power control, and so on. While this second aspect has been deeply investigated in literature, the first aspect has been mainly faced with static or semi-dynamic reuse utilization solutions. In this paper we deal with the problem of multi-cellular resource allocation in heterogeneous OFDMA environments with reuse factor equal to 1, where base stations with different power constraints coex…
Análisis de un modelo de tutorización de TFG en el Espacio Europeo de Educación Superior: una aplicación en el Grado de Relaciones Laborales y Recurs…
2016
The aim of this research paper is to present a new tutoring model for the Final Degree Project (FDP ), related to the university reform process. The experimentation process of this model was carried out in the Degree of Labour Relations and Human Resources at the University of Valencia.The consistency of the supporting process offered by the professor to the student, and the main innovations introduced in higher education by the convergence of "Bologna Process" will be analysed.The two main points of the new educational scenario, that is to say the change in the teacher's role and their relationship with the student are both taken into account in the model design. Furthermore, the pillars o…
Demo - A Cell-level Traffic Generator for LoRa Networks
2017
In this demo we present and validate a LoRa cell traffic generator, able to emulate the behavior of thousands of low-rate sensor nodes deployed in the same cell, by using a single Software Defined Radio (SDR) platform. Differently from traditional generators, whose goal is creating packet flows which emulate specific applications and protocols, our focus is generating a combined radio signal, as seen by a gateway, given by the super-position of the signals transmitted by multiple sensors simultaneously active on the same channel. We argue that such a generator can be of interest for testing different network planning solutions for LoRa networks.
Automated vehicles' work planning in flexible manufacturing systems
2006
The problem of rules setting in coordination of automated vehicles access to shared system resources (sections of their transportation paths) which assure a deadlock free and starvation free flow of the executed processes belongs to NP-hard problems. Assuming that there are local (controlling access to shared resources) rules of priority dispatching, the problem deals with setting conditions sufficient for a pair (initial state, set of priority dispatching rules). The assumed knowledge base way of specifying a transportation subsystem leads to solving a logic-algebraic method decision problem. In this regard, the working knowledge representation synthesis method constitutes a significant co…
An exact algorithm for the min-cost network containment problem
2004
A network design problem which arises in the distribution of a public utility provided by several competitive suppliers is studied. The problem addressed is that of determining minimum-cost (generalized) arc capacities in order to accommodate any demand between given source–sink pairs of nodes, where demands are assumed to fall within predetermined ranges. Feasible flows are initially considered as simply bounded by the usual arc capacity constraints. Then, more general linear constraints are introduced which may limit the weighted sum of the flows on some subsets of arcs. An exact cutting plane algorithm is presented for solving both of the above cases and some computational results are re…
Cycling for Home-to-School Travel in Palermo: A Method for Assessing the Optimal Allocation of New Cycling Infrastructure
2019
In order to reduce the number of cars on the road, one of the most incisive actions is to encourage cycling, e.g. through the introduction of bike-sharing systems. In particular, the activation of special bike-sharing programs for school students could lead students to choose this mode of transport to make their own home-school travel. The success of such initiatives is primarily linked to the presence of a continuous and functional cycle network, which can create safe routes to school. It is, therefore, necessary a cycle network design model that allows determining the optimal allocation of new cycle paths, maximizing the number of users and considering technical and economic constraints. …